Design of Coded Slotted ALOHA With Interference Cancellation Errors

Coded Slotted ALOHA (CSA) is a random access scheme based on the application of packet erasure correcting codes to transmitted packets and use successive interference cancellation at receiver. CSA has been widely studied common assumption that can always be applied perfectly. In this paper, we study design protocol, accounting for non-zero probability error due imperfect (IC). A classical method evaluate performance such protocols density evolution, originating from coding theory, adapt our assumptions. Analyzing convergence evolution in asymptotic conditions, derive optimal parameters CSA, i.e., set code selection probabilities users maximizes channel load. new parameter introduced model loss rate system, which potential IC errors. Multi-packet reception (MPR) 2-MPR are also studied. We investigate trade-off between load rate, sheds light distributions outperform known ones. Finally, show analytical results consistent with simulations obtained finite number slots.